A multi-modi Proof Planner

نویسنده

  • Lassaad Cheikhrouhou
چکیده

Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical eld. This paradigm is adopted in the mega proof development system, to provide support for the user. A considerable part of the proof construction and even sometimes the whole work can be undertaken by a proof planner. In the mega project we are investigating the aspect of computation under bounded resources in mathematical theorem proving. The relevant resources are, in addition to time and memory space, user availability as well as the frequency of user interaction. At this issue, the proof planner of mega is conceived in such a way that it has a resource-adaptive behaviour. This property of the planner is achieved by a planner modus which deenes the planner behaviour depending on which and how many resources are available. In this paper, we describe the diierent modi of the mega planner and highlight the main aspects of resource-adaptivity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantically Guided Mega Proof Planner Semantically Guided Mega Proof Planner

Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning takes a diierent perspective and uses semantic information as search control heuristics. In thi...

متن کامل

Proof Planning with Semantic Guidance

Proof planning [2, 10] is a reasoning process in which mathematical theorem proving is viewed as a planning problem. It incorporates domain-dependent and/or general mathematical knowledge, and shows a great potential in the area where the traditional logicbased theorem proving systems have been typically weak. The plan operator – method – encodes a piece of mathematical knowledge. When there ar...

متن کامل

Adaptive Access to a Proof Planner

Mathematical tools such as computer algebra systems and interactive and automated theorem provers are complex systems and can perform difficult computations. Typically, such tools are used by a (small) group of particularly trained and skilled users to assist in mathematical problem solving. They can also be used as back-engines for interactive exercises in learning environments. This, however,...

متن کامل

Classifying Isomorphic Residue Classes

We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using di erent proving techniques, which are implemented as strategies in a multi-strategy proof planner. We show how these techniques help to successfully derive proofs in our domain and ex...

متن کامل

Towards Mixed-Initiative Rationale-Supported Planning

This paper introduces our work on mixed-initiative, rationale-supported planning. The work centers on the principled reuse and modi cation of past plans by exploiting their justi cation structure. The goal is to record as much as possible of the rationale underlying each planning decision in a mixed-initiative framework where human and machine planners interact. This rationale is used to determ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998